Amalgams, blocks, weights, fusion systems and finite simple groups
نویسندگان
چکیده
منابع مشابه
Algorithmic Problems in Amalgams of Finite Groups
Geometric methods proposed by Stallings [53] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [4, 25, 37, 38, 43, 48, 56]. It turns out that Stallings’ methods can be effectively generalized for the class of amalgams of finite groups [39]. In the present paper we employ subgroup gr...
متن کاملDEFECT ZERO p−BLOCKS FOR FINITE SIMPLE GROUPS
We classify those finite simple groups whose Brauer graph (or decomposition matrix) has a p-block with defect 0, completing an investigation of many authors. The only finite simple groups whose defect zero p−blocks remained unclassified were the alternating groups An. Here we show that these all have a p-block with defect 0 for every prime p ≥ 5. This follows from proving the same result for ev...
متن کاملFinite Permutation Groups and Finite Simple Groups
In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been announced. Of course, the solution will have a considerable effect on many related areas, both wi...
متن کاملAlgorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection
Geometric methods proposed by Stallings [46] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [3, 19, 29, 30, 36, 41, 49]. In the present paper we employ the generalized Stallings’ methods, developed by the author in [32], to solve various algorithmic problems concerning finitely g...
متن کاملStallings Foldings and Subgroups of Amalgams of Finite Groups
In the 1980’s Stallings [35] showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse automaton. This allows for the deep algorithmic theory of finite automata and finite inverse monoids to be used to answer questions about finitely generate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2007
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2007.05.010